Smoothing Algorithms for State-Space Models
نویسندگان
چکیده
A prevalent problem in statistical signal processing, applied statistics, and time series analysis is the calculation of the smoothed posterior distribution, which describes the uncertainty associated with a state, or a sequence of states, conditional on data from the past, the present, and the future. The aim of this paper is to provide a rigorous foundation for the calculation, or approximation, of such smoothed distributions, to facilitate a robust and efficient implementation. Through a cohesive and generic exposition of the scientific literature we offer several novel extensions such that one can perform smoothing in the most general case. Experimental results for: a Jump Markov Linear System; a comparison of particle smoothing methods; and parameter estimation using a particle implementation of the EM algorithm, are provided. Index Terms State space smoothing, Hidden Markov Model, Kalman filter, Kalman smoother, Jump Markov Linear System, Particle filter, Particle smoother, Parameter estimation.
منابع مشابه
SsfPack 2.0: Statistical algorithms for models in state space An Ox link to underlying C code
This paper discusses and documents the algorithms provided by SsfPack 2.0 (release date March 30, 1998). SsfPack is a suite of C routines for carrying out computations involving the statistical analysis of univariate and multivariate models in state space form. Functions are available for prediction, filtering, moment smoothing, simulation smoothing and forecasting. The headers of these routine...
متن کاملAnalysis of filtering and smoothing algorithms for Lévy-driven stochastic volatility models
Filtering and smoothing algorithms that estimate the integrated variance in Lévy-driven stochastic volatility models are analyzed. Particle filters are algorithms designed for nonlinear, nonGaussian models while the Kalman filter remains the best linear predictor if the model is linear but non-Gaussian. Monte Carlo experiments are performed to compare these algorithms across different specifica...
متن کاملPropagation Algorithms for Variational Bayesian Learning
Variational approximations are becoming a widespread tool for Bayesian learning of graphical models. We provide some theoretical results for the variational updates in a very general family of conjugate-exponential graphical models. We show how the belief propagation and the junction tree algorithms can be used in the inference step of variational Bayesian learning. Applying these results to th...
متن کاملOn Solving General State-Space Sequential Decision Problems using Inference Algorithms
A recently proposed formulation of the stochastic planning and control problem as one of parameter estimation for suitable artificial statistical models has led to the adoption of inference algorithms for this notoriously hard problem. At the algorithmic level, the focus has been on developing Expectation-Maximization (EM) algorithms. For example, Toussaint et al (2006) uses EM with optimal smo...
متن کاملModeling and Estimation of Discrete-Time Reciprocal Processes via Probabilistic Graphical Models
Reciprocal processes are acausal generalizations of Markov processes introduced by Bernstein in 1932. In the literature, a significant amount of attention has been focused on developing dynamical models for reciprocal processes. In this paper, we provide a probabilistic graphical model for reciprocal processes. This leads to a principled solution of the smoothing problem via message passing alg...
متن کاملNonlinear System Identification Using Hammerstein-Wiener Neural Network and subspace algorithms
Neural networks are applicable in identification systems from input-output data. In this report, we analyze theHammerstein-Wiener models and identify them. TheHammerstein-Wiener systems are the simplest type of block orientednonlinear systems where the linear dynamic block issandwiched in between two static nonlinear blocks, whichappear in many engineering applications; the aim of nonlinearsyst...
متن کامل